Crossing Number Bounds for the Mesh of Trees
نویسنده
چکیده
Crossing number bounds for the mesh of trees graph are derived.
منابع مشابه
Improved Bounds for the Crossing Number of the Mesh of Trees
Improved bounds for the crossing number of the mesh of trees graph, Mn, are derived. In particular, we derive a new lower bound of 5n log n−44n 80 ‡ which improves on the previous bound of Leighton [11] by a constant factor, and an upper bound of (log n− 10 3 )n 2 + 8n− 20 3 . In addition, we construct drawings of Mn which achieve the upper bound number of crossings. We also prove that the cros...
متن کاملTopological Properties of Some Interconnection Network Graphs
Interconnection networks play a vital role in parallel computing architectures. We investigate topological properties of some networks proposed for parallel computation, based on their underlying graph models. The vertices of the graph correspond to processors and the edges represent communication links between processors. Parameters such as crossing number and thickness strongly aaect the area...
متن کاملBounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
متن کاملNew Exact Results and Bounds for Bipartite Crossing Numbers of Meshes
The bipartite crossing number of a bipartite graph is the minimum number of crossings of edges when the partitions are placed on two parallel lines and edges are drawn as straigh line segments between the lines. We prove exact results, asymtotics and new upper bounds for the bipartite crossing numbers of 2-dimensional mesh graphs. Especially we show that bcr(P6 × Pn) = 35n − 47, for n ≥ 7.
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007